Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions
نویسندگان
چکیده
منابع مشابه
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the L∞-norm. A new class of shape ...
متن کاملA new algorithm for computing the 2-dimensional matching distance between size functions
Size Theory has proven to be a useful geometrical/topological approach to shape analysis and comparison. Originally introduced by considering 1-dimensional properties of shapes, described by means of real-valued functions, it has been subsequently generalized to take into account multidimensional properties coded by functions valued in Rk. In the context of Size Theory, this generalization has ...
متن کاملThe Natural Pseudo-distance as a Quotient Pseudo-metric, and Applications
The natural pseudo-distance is a similarity measure conceived for the purpose of comparing shapes. In this paper we revisit this pseudo-distance from the point of view of quotients. In particular, we show that the natural pseudo-distance coincides with the quotient pseudo-metric on the space of continuous functions on a compact manifold, endowed with the uniform convergence metric, modulo self-...
متن کاملNatural pseudo-distances between closed curves
as the infimum of Θ(f) def = maxP∈M |φ(P )− ψ(f(P ))|, as f varies in the set of all homeomorphisms from M ontoN . The problem of finding the possible values for d naturally arises. In this paper we prove that under appropriate hypotheses the natural pseudo-distance equals either |c1−c2| or 12 |c1−c2|, where c1 and c2 are two suitable critical values of the measuring functions. This equality sh...
متن کاملOptimal Facility Location under Various Distance Functions
We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Applicandae Mathematicae
سال: 2008
ISSN: 0167-8019,1572-9036
DOI: 10.1007/s10440-008-9332-1